Successive Refinement With Decoder Cooperation and Its Channel Coding Duals
نویسندگان
چکیده
منابع مشابه
Channel capacity of polar coding with a given polar mismatched successive cancellation decoder
Arıkan’s polar coding, is by now a well studied technique that allows achieving the symmetric capacity of binary input memoryless channels with low complexity encoding and decoding, provided that the polar decoding architecture is used and the decoding metric is matched to the true channel. In this paper, we analyze communication rates that are achievable when the polar coding/decoding architec...
متن کاملOptimal Power Distribution and Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive Refinement
A transmitter without channel state information (CSI) wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining the description in the previous one. The receiver decodes the layers that are supported by the channel realization and reconstructs the source up to a distortion. The expected distorti...
متن کاملVector set partitioning with classified successive refinement VQ for embedded wavelet image and video coding
The Set Partitioning in Hierarchical Trees (SPIHT) approach for still image compression proposed by Said and Pearlman [8], is one of the most efficient embedded gray image compression schemes till date. The algorithm relies on a very efficient scanning cum bit-allocation scheme for quantizing the coefficients obtained by a wavelet decomposition of an image. In this paper, we adopt this scheme t...
متن کاملSuccessive refinement of information
269 Abslruct-The successive refinement of information consists of first approximating data using a few hits of information, then iteratively improving the approximation as more and more information is supplied. The goal is to achieve an optimal description at each stage. In general an ongoing description is sought which is rate-distortion optimal whenever it is interrupted. It is shown that a r...
متن کاملAdditive successive refinement
Rate-distortion bounds for scalable coding, and conditions under which they coincide with nonscalable bounds, have been extensively studied. These bounds have been derived for the general tree-structured refinement scheme, where reproduction at each layer is an arbitrarily complex function of all encoding indexes up to that layer. However, inmost practical applications (e.g., speech coding) “ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2266655